Your selections:
A parameterized route to exact puzzles: breaking the 2n-barrier for irredundance
- Binkele-Raible, Daniel, Brankovic, Ljiljana, Fernau, Henning, Kneis, Joachim, Kratsch, Dieter, Langer, Alexander, Liedloff, Mathieu, Rossmanith, Peter
Clustering with partial information
- Bodlaender, Hans L., Fellows, Michael R., Heggernes, Pinar, Mancini, Frederico, Papadopoulos, Charis, Rosamond, Frances
Parameterized algorithmics for d-HITTING SET
Derivation of algorithms for cutwidth and related graph layout parameters
- Bodlaender, Hans L., Fellows, Michael R., Thilikos, Dimitrios M.
Facility location problems: a parameterized view
- Fellows, Michael, Fernau, Henning
On problems without polynomial kernels
- Bodlaender, Hans L., Downey, Rodney G., Fellows, Michael R., Hermelin, Danny
On the parameterized complexity of layered graph drawing
- Dujmovic, Vida, Fellows, Michael R., Kitching, Matthew, Liotta, Giuseppe, McCartin, Catherine, Nishimura, Naomi, Ragde, Prabhakar, Rosamond, Frances, Whitesides, Sue, Wood, David R.
Parameterized complexity and biopolymer sequence comparison
- Cai, Liming, Huang, Xiuzhen, Liu, Chunmei, Rosamond, Frances, Song, Yinglei
Are you sure you would like to clear your session, including search history and login status?